| 翻訳と辞書 |
| Hashed array tree ： ウィキペディア英語版 |
Hashed array tree
In computer science, a hashed array tree (HAT) is a dynamic array data-structure published by Edward Sitarski in 1996, maintaining an array of separate memory fragments (or "leaves") to store the data elements, unlike simple dynamic arrays which maintain their data in one contiguous memory area. Its primary objective is to reduce the amount of element copying due to automatic array resizing operations, and to improve memory usage patterns.
Whereas simple dynamic arrays based on geometric expansion waste linear (Ω(''n'')) space, where ''n'' is the number of elements in the array, hashed array trees waste only order ''O''() storage space. An optimization of the algorithm allows to eliminate data copying completely, at a cost of increasing the wasted space.
It can perform access in constant (O(1)) time, though slightly slower than simple dynamic arrays. The algorithm has O(1) amortized performance when appending a series of objects to the end of a hashed array tree. Contrary to its name, it does not use hash functions.
==Definitions==
As defined by Sitarski, a hashed array tree has a top-level directory containing a power of two number of leaf arrays. All leaf arrays are the same size as the top-level directory. This structure superficially resembles a hash table with array-based collision chains, which is the basis for the name ''hashed array tree''. A full hashed array tree can hold ''m''2 elements, where ''m'' is the size of the top-level directory.〔 The use of powers of two enables faster physical addressing through bit operations instead of arithmetic operations of quotient and remainder〔 and ensures the O(1) amortized performance of append operation in the presence of occasional global array copy while expanding.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Hashed array tree」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|